Tournaments and Orders with the Pigeonhole Property
نویسندگان
چکیده
A binary structure S has the pigeonhole property (P) if every finite partition of S induces a block isomorphic to S. We classify all countable tournaments with (P); the class of orders with (P) is completely classified.
منابع مشابه
Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1
A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied by Bonato, Delić and Cameron. We classify the countable graphs, tournaments, and oriented graphs...
متن کاملBounds and constructions for n-e.c. tournaments
Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive n-e.c. tournaments by considering circulant tournaments. Switching is used to generate new ne.c. tournaments of certain orders. With aid of a computer search, we demonstrate that there is a unique minimum order 3-e.c. tournamen...
متن کاملA note on orientations of the infinite random graph
We answer a question of P. Cameron’s by giving examples of 2א0 many non-isomorphic acyclic orientations of the infinite random graph with a topological ordering that do not have the pigeonhole property. Our examples also embed each countable linear ordering. A graph is n-existentially closed or n-e.c. if for each n-subset S of vertices, and each subset T of S (possibly empty), there is a vertex...
متن کاملA Recurrence for Bounds on Dominating Sets in k-Majority Tournaments
A k-majority tournament is realized by 2k−1 linear orders on the set of vertices, where a vertex u dominates v if u precedes v in at least k of the orders. Various properties of such tournaments have been studied, among them the problem of finding the size of a smallest dominating set. It is known that 2-majority tournaments are dominated by 3 vertices and that k-majority tournaments are domina...
متن کاملt-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کامل